Recursively enumerable set

Results: 50



#Item
212 Alice: Vittorio: Riccardo: Sergio: Alice:

2 Alice: Vittorio: Riccardo: Sergio: Alice:

Add to Reading List

Source URL: webdam.inria.fr

Language: English - Date: 2010-02-12 06:45:46
22Objective mathematics in a finite unbounded universe Paul Budnik Mountain Math Software [removed] February 24, 2014

Objective mathematics in a finite unbounded universe Paul Budnik Mountain Math Software [removed] February 24, 2014

Add to Reading List

Source URL: mtnmath.com

Language: English - Date: 2014-02-24 17:59:08
23Incompleteness versus a Platonic multiverse Paul Budnik Mountain Math Software [removed] c 2013 Mountain Math Software

Incompleteness versus a Platonic multiverse Paul Budnik Mountain Math Software [removed] c 2013 Mountain Math Software

Add to Reading List

Source URL: mtnmath.com

Language: English - Date: 2013-06-12 13:25:59
24Incompleteness versus a Platonic multiverse Paul Budnik Mountain Math Software [removed] c 2013 Mountain Math Software

Incompleteness versus a Platonic multiverse Paul Budnik Mountain Math Software [removed] c 2013 Mountain Math Software

Add to Reading List

Source URL: www.mtnmath.com

Language: English - Date: 2013-06-12 13:25:59
25Objective mathematics in a finite unbounded universe Paul Budnik Mountain Math Software [removed] February 24, 2014

Objective mathematics in a finite unbounded universe Paul Budnik Mountain Math Software [removed] February 24, 2014

Add to Reading List

Source URL: www.mtnmath.com

Language: English - Date: 2014-02-24 17:59:08
26The Intensional Content of Rice’s Theorem (Pearl) Andrea Asperti Department of Computer Science, University of Bologna Mura Anteo Zamboni 7, 40127, Bologna, ITALY [removed]

The Intensional Content of Rice’s Theorem (Pearl) Andrea Asperti Department of Computer Science, University of Bologna Mura Anteo Zamboni 7, 40127, Bologna, ITALY [removed]

Add to Reading List

Source URL: www.cs.unibo.it

Language: English - Date: 2007-10-31 03:46:45
27ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS RODNEY G. DOWNEY, CARL G. JOCKUSCH, JR., AND PAUL E. SCHUPP Abstract. We study connections between classical asymptotic density, computability and computable enumerabilit

ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS RODNEY G. DOWNEY, CARL G. JOCKUSCH, JR., AND PAUL E. SCHUPP Abstract. We study connections between classical asymptotic density, computability and computable enumerabilit

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2013-07-19 19:14:33
28ASYMPTOTIC DENSITY AND THE ERSHOV HIERARCHY ROD DOWNEY, CARL JOCKUSCH, TIMOTHY H. MCNICHOLL, AND PAUL SCHUPP Abstract. We classify the asymptotic densities of the ∆02 sets according to their level in the Ershov hierarc

ASYMPTOTIC DENSITY AND THE ERSHOV HIERARCHY ROD DOWNEY, CARL JOCKUSCH, TIMOTHY H. MCNICHOLL, AND PAUL SCHUPP Abstract. We classify the asymptotic densities of the ∆02 sets according to their level in the Ershov hierarc

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2014-02-03 11:22:38
29Questions in Recursion Theory December 1997 This is an informal list of some open problems in recursion theory. Solutions and new questions are welcome, as well as corrections to the attributions given below. Please, sen

Questions in Recursion Theory December 1997 This is an informal list of some open problems in recursion theory. Solutions and new questions are welcome, as well as corrections to the attributions given below. Please, sen

Add to Reading List

Source URL: math.berkeley.edu

Language: English - Date: 2002-11-21 07:33:52
30Generators and Automorphism Bases of the Computably Enumerable Degrees

Generators and Automorphism Bases of the Computably Enumerable Degrees

Add to Reading List

Source URL: www.ims.nus.edu.sg

Language: English - Date: 2010-01-12 23:03:20